Description: 为得到使电文总长最短的二进制前缀编码，则以n种字符出现的频率作权，设计一棵Huffman树，求出给定权值的字符对应的Huffman编码。-enable the message to be chief of the shortest prefix binary coding, while the n characters of frequencies for the right to design a Huffman tree, obtained the right to set the value of the characters in the corresponding Huffman coding. Platform: |
Size: 9185 |
Author:张磊 |
Hits:
Description: 为得到使电文总长最短的二进制前缀编码，则以n种字符出现的频率作权，设计一棵Huffman树，求出给定权值的字符对应的Huffman编码。-enable the message to be chief of the shortest prefix binary coding, while the n characters of frequencies for the right to design a Huffman tree, obtained the right to set the value of the characters in the corresponding Huffman coding. Platform: |
Size: 9216 |
Author:张磊 |
Hits:
Description: 给定若干个字符及其对应的权重，建造一颗高度尽可能小的Huffman树及字符的Huffman编码。-given a number of characters and their corresponding weights, construction of a high as possible Huffman tree and the character of Huffman coding. Platform: |
Size: 481280 |
Author:梁清华 |
Hits:
Description: 数据结构，二叉树和哈夫曼编码。C++
1、 学会针对DFA转换图实现相应的高级语言源程序
·a C++ Class Library of Cr
·简单的防火墙，可以用来学习，作为毕业课设也相当有帮
·实现ARM 芯片的一对PWM 输出用于控制直流电机
·Programming the Microsoft
·VC调用java的简单例子。需要注意jvm.dll
·这是介绍在VC++6。0下如何编写GPIB程序。有
·GPS坐标转换软件：直角坐标与大地坐标转换
·我的一个同学写的毕业论文 希望对大家来说是有用的
·最简单的用工作线程控制有进程条的窗口,主窗口调用后
·VC数据库编程综合应用。订单的管理
·vhdl,用i2c控制philips的7111和7
·基于winsock2的网络封包截获技术,源代码清楚
-data structure, binary tree and Huffman coding. C 1. Society against DFA conversion map corresponding high-level language source of a Class C of C Library r simple firewall can be used to study, as part of the graduation class is fairly established to help achieve the ARM chip of a PWM output for controlling Motor Prog ramming the Microsoft VC called java simple example. This needs attention jvm.dll is introduced in VC 6. 0 GPIB preparation procedures. Have GPS coordinates conversion software : Cartesian coordinates of the earth and converting one of my classmates wrote the dissertation hope for all of us is the most useful simple Working with a thread control of the process window, the main window after calling VC Database Programming integrated application. Vhdl orders management, i2c co Platform: |
Size: 3072 |
Author: |
Hits:
Description: 我的一次数据结构课程设计HUFFMAN树的C++源代码，基本功能有：
1.显示27个字符的haffman编码；
2.输入m个字符，对应27个字符的权值进行haffman编码；
3.输入一串字符，用已经定义的haffman编码输出；-a data structure course design Speed HUFFMAN tree C source code, the basic function : 1. show 27 characters haffman coding; 2. m input characters, 27 characters corresponding to the value haffman coding; 3. imported a bunch of characters using a definition of haffman coding output; Platform: |
Size: 2048 |
Author:ARK |
Hits:
Description: 哈夫曼树和哈夫曼编码：
从终端输入若干个字符及其对应的整数，将整数作为结点的权值，建立哈夫曼树，然后对各字符进行哈夫曼编码。最后打印哈夫曼树和对应的哈夫曼编码。
设计要求：
⑴ 哈夫曼殊和哈夫曼编码的存储表示参考教材事例
⑵ 在程序中构造四个子程序为
① int createhtree(HTree *t) /*根据输入的字符及其权值建立哈夫曼树*/
② void coding(HTree *t, char *code) /*对哈夫曼树进行编码*/
③ void printhtree(HTree *t, int* path) /*中序打印树*/
④ void printcode(HTree *t) /*输出个字符的哈夫曼编码*/
-Huffman tree and the Huffman coding: input from the terminal a number of characters and their corresponding integer, will be an integer as node weights, the establishment of Huffman tree, and then on the characters Huffman. Finally print Huffman tree and the corresponding Huffman. Design requirements: ⑴ Huffman and Huffman coding is that the reference materials storage ⑵ examples constructed in the procedure for the four subroutines ① int createhtree (HTree* t)/* input characters in accordance with its right value the establishment of Huffman tree*/② void coding (HTree* t, char* code)/* Huffman tree to encode*/③ void printhtree (HTree* t, int* path)/* Print the tree in order*/④ void printcode (HTree* t)/* output of the Huffman coding characters* / Platform: |
Size: 1024 |
Author:秋 |
Hits:
Description: 程序功能说明： 根据ascⅡ码文件中各ascⅡ字符出现的频率情况创建Haffman树，再将各字符对应的哈夫曼编码写入文件中。同时，亦可根据对应的哈夫曼树，将哈夫曼编码文件解压成字符文件。
-Programming note: In accordance with Code asc Ⅱ document various characters asc Ⅱ frequency situation created Haffman tree, and then the characters in the corresponding Huffman write file. At the same time, also in accordance with the corresponding Huffman tree, the Huffman encoding of characters into a document file decompression. Platform: |
Size: 53248 |
Author:姚晶晶 |
Hits:
Description: 对任意输入的一段英文，为每个字符编制其相应的赫夫曼编码；并利用该编码为任意输入的0、1序列进行解码.（1）初始化： 从终端读入一段英文字符，统计每个字符出现的频率，建立赫夫曼树，并将该树存入某文件；（2）编码： 利用建好的赫夫曼树对各字符进行编码，用列表的形式显示在屏幕上，并将编码结果存入另一文件中；（3）解码:利用保存的赫夫曼编码，对任意输入的0，1序列能正确解码。-A section of the indiscriminate importation of English, for each character the preparation of their corresponding Huffman coding and use the coding for arbitrary input sequence decoding 0,1. (1) Initialization: read from the terminal section of the English characters, statistical frequency of each character, the establishment of Huffman tree, and the tree into a document (2) Coding: Using the Huffman tree is built on the character encoding, using the list displayed on the screen and coding the results into another document (3) decoder: Using saved Huffman coding, for arbitrary input sequences correctly decode 0,1. Platform: |
Size: 17408 |
Author:侯健 |
Hits:
Description: 输入一段英文字符，试为该文中的每个字符编制相应的哈夫曼码。
（1）I：初始化（Initialization）。对输入的一段英文中的每个字符统计其权值，建立哈夫曼树；
（2）E：编码（Encoding）。利用已建好的哈夫曼树，对每个字符进行编码。
（3）D：译码（Decoding）。利用已建好的每个编码，对输入的一个由0、1组成的序列进行译码；
（4）P：印代码文件（Print）。将每个字符编的哈夫曼码和译码结果显示在终端上。
-Enter a period of English characters, try the text for each character corresponding Huffman code. (1) I: Initialization (Initialization). A section of the input English characters statistics for each value of its right to establish a Huffman tree (2) E: encoding (Encoding). Has been built using Huffman tree for each character encoding. (3) D: Decoding (Decoding). Use has been completed for each encoding, the input of a sequence consisting of 0,1 Decoding (4) P: Printing code files (Print). Will be allocated for each character code and the Huffman decoding results are displayed in terminal. Platform: |
Size: 2048 |
Author:alic |
Hits:
Description: 题 目: 哈夫曼编码的程序设计
初始条件：
输入一段英文字符，试为该文中的每个字符编制相应的哈夫曼码。
（1）I：初始化（Initialization）。对输入的一段英文中的每个字符统计其权值，建立哈夫曼树；
（2）E：编码（Encoding）。利用已建好的哈夫曼树，对每个字符进行编码。
（3）D：译码（Decoding）。利用已建好的每个编码，对输入的一个由0、1组成的序列进行译码；
（4）P：印代码文件（Print）。将每个字符编的哈夫曼码和译码结果显示在终端上。
-Title: Huffman coding programming initial conditions: Enter the period of English characters, try the text for each character corresponding Huffman code. (1) I: Initialization (Initialization). A section of the input English characters statistics for each value of its right to establish a Huffman tree (2) E: encoding (Encoding). Has been built using Huffman tree for each character encoding. (3) D: Decoding (Decoding). Use has been completed for each encoding, the input of a sequence consisting of 0,1 Decoding (4) P: Printing code files (Print). Will be allocated for each character code and the Huffman decoding results are displayed in terminal. Platform: |
Size: 264192 |
Author:陈宗浩 |
Hits:
Description: 哈夫曼树的建立 根据学生成绩出现的频率创建相应的哈夫曼树-Huffman tree establishment in accordance with the frequency of student achievement to create the corresponding Huffman tree Platform: |
Size: 1024 |
Author:huang |
Hits:
Description: 根据ascii码文件中各ascii字符出现的频率情况创建Haffman树，再将各字符对应的哈夫曼编码写入文件中，实现文件压缩。-In accordance with ascii code ascii characters in the document the frequency of the situation created Haffman tree, and then the character of the Huffman code corresponding to write documents, files compression. Platform: |
Size: 816128 |
Author:郭峰 |
Hits:
Description: 哈夫曼编码
问题描述：利用哈夫曼编码，实现压缩和解压缩
基本要求：
对于给定的一组字符，可以根据其权值进行哈夫曼编码，并能输出对应的哈夫曼树和哈夫曼编码；实现哈夫曼解码
提高要求：
（1） 能够分析文件，统计文件中出现的字符，再对文件进行编码，实现文件的压缩和解压缩
（2） 能够对于文件的压缩比例进行统计
（3） 能够打印文件
这是数据结构的课程设计-Huffman Coding Problem Description: Using the Huffman coding, compression and decompression to achieve the basic requirements: For a given set of characters, can be carried out in accordance with their weights Huffman coding, and can output the corresponding Huffman tree and Ha Huffman coding to achieve Huffman decoding to improve requirements: (1) to analyze documents, statistics of characters appear in the file, then encode the file to achieve the file compression and decompression (2) to the file compression ratio for the statistical ( 3) to print the file Platform: |
Size: 193536 |
Author:dian |
Hits:
Description: 自动构建霍夫曼树，可以根据输入自动构建霍夫曼树并生成相应的霍夫曼编码，本源码执行速度快。-Automatic Construction of Huffman tree can be automatically constructed based on the input and generate a corresponding Huffman tree, Huffman coding, the source execution speed. Platform: |
Size: 100352 |
Author:石鑫 |
Hits:
Description: 输入字符以及对应的概率权值，构建哈夫曼树；通过程序计算出哈夫曼编码并输出结构-Enter the characters and the corresponding probability weights to construct the Huffman tree Huffman calculated by the program and output structure Platform: |
Size: 1024 |
Author:徐彬鹏 |
Hits:
Description: 实现Huffman编码、解码功能。
主函数的流程：定义Huffman树T并初始化T。提示手动输入文本文件或者加载 已存在的文本文件，然后程序进入主菜单Main Menue()，根据输 入的选择项调用相应的函数、实现相应的逻辑功能。-Achieve Huffman encoding, decoding functions. The main function of the process: Define Huffman tree T and initialize T. Prompted to manually input text file or load a text file already exists, then the program enters the main menu Main Menue (), according to the input selection corresponding function calls to achieve the corresponding logic function. Platform: |
Size: 74752 |
Author:eve |
Hits:
Description: 对任意输入的一段英文，为每个字符编制其相应的赫夫曼编码；并利用该编码为任意输入的0、1序列进行解码．
基本要求：一个完整的系统应具有以下功能：
（1）初始化 从终端读入一段英文字符，统计每个字符出现的频率，建立赫夫曼树，并将该树存入某文件；
（2）编码 利用建好的赫夫曼树对各字符进行编码，用列表的形式显示在屏幕上，并将编码结果存入另一文件中；
（3）解码 利用保存的赫夫曼编码，对任意输入的0，1序列能正确解码；
-Section for any input in English, prepared for each character the corresponding Huffman code and use the encoding sequence for any input decode 0,1. Basic requirements: a complete system should have the following functions: (1) initialize a read from the terminal and English characters, the frequency statistics for each character, the establishment of Huffman tree and the tree into a document ( 2) encoding the Huffman tree is built using the character encoding, using the list displayed on the screen, and coding the results into another file (3) decoding the Huffman coding using saved on Any input can be correctly decoded sequence 0,1 Platform: |
Size: 12288 |
Author:何杰 |
Hits:
Description: 使用三叉链表实现的哈夫曼树,统计inputfile1.txt中各字符的出现频率，并据此构造Huffman树，编制Huffman 码；根据已经得到的编码，对01形式的编码段进行译码。
具体的要求：
1．将给定字符文件编码，生成编码，输出每个字符出现的次数和编码；
2．将给定编码文件译码，生成字符，输出编码及其对应字符。
-Emergence of the frequency of each character in the trigeminal lists using the Huffman tree, statistics inputfile1.txt, and accordingly the Huffman tree structure, preparation of Huffman code according to the coding has been. 01 to form the code segment for decoding.
Specific requirements:
1 coding the given character file, generating the encoding, and outputting the number and encoding of each character
2 will be given the encoding file decoding, generating the character, the output code and its corresponding character. Platform: |
Size: 2870272 |
Author:yyy |
Hits:
Search - corresponding huffman tree